Interpolant-Based Transition Relation Approximation
نویسندگان
چکیده
منابع مشابه
Interpolant-Based Transition Relation Approximation
In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of predicates. We present an interpolant-based method for strengthening the abst...
متن کاملInterpolant Strength
Interpolant-based model checking is an approximate method for computing invariants of transition systems. The performance of the model checker is contingent on the approximation computed, which in turn depends on the logical strength of the interpolants. A good approximation is coarse enough to enable rapid convergence but strong enough to be contained within the weakest inductive invariant. We...
متن کاملInterpolant Generation for UTVPI
The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for interpolant generation have been presented for some theories of interest –including that of equality and uninterpreted functions (EUF), linear arithmetic over the rationals (LA(Q)), and some fragments of linear arithmetic over t...
متن کاملInterpolant Strength Revisited
Craig’s interpolation theorem has numerous applications in model checking, automated reasoning, and synthesis. There is a variety of interpolation systems which derive interpolants from refutation proofs; these systems are ad-hoc and rigid in the sense that they provide exactly one interpolant for a given proof. In previous work, we introduced a parametrised interpolation system which subsumes ...
متن کاملNon-linear sampling recovery based on quasi-interpolant wavelet representations
We investigate a problem of approximate non-linear sampling recovery of functions on the interval I:=[0,1] expressing the adaptive choice of n sampled values of a function to be recovered, and of n terms from a given family of functions Φ. More precisely, for each function f on I, we choose a sequence ξ = {ξs} s =1 n of n points in I, a sequence a = {as}s=1} n of n functions defined on n and a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2007
ISSN: 1860-5974
DOI: 10.2168/lmcs-3(4:1)2007